Library Suggestion Engine

ABSTRACT

A method and apparatus are disclosed for enhancing operable functionality of input source code files from a software program by identifying candidate code snippets from the plurality of input source code files that meet a similarity threshold measure for library functions stored in the system library and then identifying at least a first validated code snippet from the candidate code snippets that matches a first library function stored in the system memory on the basis of at least first and second matching metrics so that the developer is presented with a library function recommendation which includes the first validated code snippet, the first library function, and instructions for replacing the first validated code snippet with the first library function.

BACKGROUND OF THE INVENTION Field of the Invention

The present invention is directed in general to field of informationprocessing. In one aspect, the present invention relates generally to asoftware program development tool, method, and apparatus in a dataprocessing system.

Description of the Related Art

Computer programmers, developers, coders and/or software engineerswrite, test, debug, and maintain computer software or code instructions,called computer programs, which computers must follow to perform theirfunctions. When writing or making changes to computer program to addressnew or unique technical challenges, programmers often create new,original and unique programming source code which can, unfortunately,suffer from performance limitations and other sub-optimalities. Forexample, a programmer's unique source code may include a number ofundetected software bugs or otherwise suffer from low quality orrobustness if the code has not been thoroughly tested, or may havereduced performance functionality if the code is outdated or has notbeen updated or maintained. Unique source code is often also bloated andless readable than desired due to inefficiencies in the computerprogram's use of memory, disk space, processing power, or other hardwareresources whilst making only dubious user-perceptible improvements orsuffering from feature creep. Programmers can address many of theseproblems by using libraries of basic code that can be modified orcustomized for a specific application, thereby yielding more reliableand consistent programs and increasing the programmer's productivity.However, there are significant difficulties with using libraries in thata significant amount of effort, knowledge, and experience is needed inorder to correctly identify a suitable library from among thousands ofstored library files, to understand the performance and codingrequirements of the library, and to make any required code adjustmentsthereto. In addition, the responsibility for using a library typicallyresides with the programmer or code reviewer, making it difficult totrack and enforce library usage. And while the use of libraries isconsidered a best practice for software development, the existingsolutions for promoting library use are extremely difficult at apractical level by virtue of the difficulty in identifying, adopting,and modifying libraries.

SUMMARY OF THE INVENTION

A system, apparatus, and methodology are described for efficientlyimproving code reuse and improving codebase maintainability byautomating the generation of library functions recommendations forreplacement or substitution of source code which is written bydevelopers. In selected embodiments, customized code suggestions forlibrary function substitutions are efficiently generated for aprogrammer's submitted source code by first using a pruning or parsingprocess to identify candidate code snippets from the source code, andthen using a matching process to identify and validate source codesnippets which are matched with recommended library functions forsubstitution in the submitted source code. Selected embodiments of thedisclosed system, apparatus, and methodology use machine learning,natural language processing (NLP), and/or artificial intelligence (AI)in combination with static and/or dynamic code analysis techniques toautomatically analyze code and yield library substitution opportunities.As a preliminary step, the input code is pruned or parsed to identifycandidate code snippets for library suggestion opportunities. Suchpruning may be implemented by generating feature vectors from the inputcode and stored library functions for use in identifying similaritiesbetween the feature vectors for use in identifying candidate codesnippets, by tokenizing input code snippets and code snippets from thelibrary functions to generate comparative file vectors which areevaluated (e.g., by dot product) against a pruning threshold to identifycandidate code snippets, by checking for the presence of predeterminedwords in the input code and assigning a corresponding weight, or by anyother suitable code filtering operations for identifying candidate codesnippets from the input code that should be further processed forlibrary suggestion opportunities. In addition or in the alternative,candidate code snippets from the (pruned) input code are match processedto identify validated code snippets that may be presented to theprogrammer with matching library function recommendations forsubstitution or replacement. Such match processing may be implementedwith a fuzzy or internal matching engine which reads and analyzes theinput code snippets (e.g., candidate code snippets) to extractpredetermined features for matching with the features extracted from agiven library function (e.g., white box matching), thereby generatingvalidated code snippets which can be replaced by a library function. Inaddition or in the alternative, match processing may be implemented withan input/output matching engine or exact matching engine which injectsshared inputs to the input code snippets and the library function methodwhich is called via the library's Java Archive (JAR) file (e.g., blackbox matching), thereby generating validated code snippets which can bereplaced by a library function. As a result of the match processing, theprogrammer may be presented with one or more library functionrecommendations which may include code lines from input source codefiles along with code lines from the library function suggestion, aloneor in combination with additional library function informationidentifying the code improvement recommendation and/or code reductionresulting from the library function recommendation and/or educationaltutorial information relating to the implementation of the libraryfunction recommendation.

The objects, advantages and other novel features of the presentinvention will be apparent from the following detailed description whenread in conjunction with the appended claims and attached drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention may be understood, and its numerous objects,features and advantages obtained, when the following detaileddescription of a preferred embodiment is considered in conjunction withthe following drawings.

FIG. 1 is a simplified block diagram of a data processing system forgenerating library function recommendations in accordance with selectedembodiments of the present disclosure.

FIG. 2 illustrates a detection workflow for generating library reuserecommendations in accordance selected embodiments of the presentdisclosure.

FIG. 3 illustrates a simplified flow chart showing the logic forrecommending validated library function substitutions to a developer inaccordance selected embodiments of the present disclosure.

FIG. 4A is a first example screen shot of user interface of a librarysuggestion engine which illustrates the evaluation of input source codefiles in accordance selected embodiments of the present disclosure.

FIG. 4B is a second screen shot of user interface of a librarysuggestion engine which illustrates a code reduction opportunity for aninput source code file in accordance selected embodiments of the presentdisclosure.

FIG. 4C is a third screen shot of user interface of a library suggestionengine which illustrates a library function recommendation for an inputsource code file in accordance selected embodiments of the presentdisclosure.

FIG. 5 is a simplified block diagram of a general-purpose computer inaccordance with selected embodiments of the present disclosure.

DETAILED DESCRIPTION

A library suggestion engine, methodology, and apparatus are describedfor efficiently generating automated library function recommendations toreplace input source code written by developers by pruning the inputsource code into candidate source code snippets, and then matching thecandidate source code snippets with corresponding library function codesnippets to generate validated code snippets which are recommended forsubstitution or replacement by matching library functionrecommendations. While various details are set forth in the followingdescription, it will be appreciated that the present invention may bepracticed without these specific details. For example, selected aspectsare shown in block diagram form, rather than in detail, in order toavoid obscuring the present invention. Some portions of the detaileddescriptions provided herein are presented in terms of algorithms oroperations on data within a computer memory. Such descriptions andrepresentations are used by those skilled in the data processing arts todescribe and convey the substance of their work to others skilled in theart. In general, an algorithm refers to a self-consistent sequence ofsteps leading to a desired result, where a “step” refers to amanipulation of physical quantities which may, though need notnecessarily, take the form of electrical or magnetic signals capable ofbeing stored, transferred, combined, compared, and otherwisemanipulated. It is common usage to refer to these signals as bits,values, elements, symbols, characters, terms, numbers, or the like.These and similar terms may be associated with the appropriate physicalquantities and are merely convenient labels applied to these quantities.Unless specifically stated otherwise as apparent from the followingdiscussion, it is appreciated that throughout the description,discussions using terms such as processing, computing, calculating,determining, displaying or the like, refer to the action and processesof a computer system, or similar electronic computing device, thatmanipulates and/or transforms data represented as physical, electronicand/or magnetic quantities within the computer system's registers andmemories into other data similarly represented as physical quantitieswithin the computer system memories or registers or other suchinformation storage, transmission or display devices.

Referring now to FIG. 1, a simplified block diagram illustrates anexemplary data processing system 100 for generating library functionrecommendations with one or more server/computer systems 10 havingprocessor(s) 11, memory 12, and associated database storage devices 21which may be connected together over a suitable connection link 34 ornetwork, such as a private wide area network (WAN) or the Internet (notshown). To illustrate the operative functionality of the data processingsystem 100, the transformation of the input source code files 22 intovalidated code snippets 25 for matching with library functions 26 areshown with processing steps 31-33, though it will be appreciated thatthe underlying data may be stored in the database storage device 21and/or memory 12. In selected illustrative embodiments, theserver/computer system 10 may include a library suggestion engine 13that is embodied as a Question Answering (QA) system to use NLP, machinelearning, and/or artificial intelligence processing techniques which areaugmented with the mechanisms of the illustrative embodiments describedhereafter. In a QA system implementation, the library suggestion engine13 may be embodied as a computer program stored in memory 12 which usesone or more processors 11 to query a structured or unstructuredknowledge or information database 21 which includes a library knowledgebase 28. Input source code files 22 are available from an externalsystem and/or may be stored in memory 12 and/or in the database storagedevice 21. Illustrated as being stored in memory 12, the librarysuggestion engine 13 may be configured to assess input source code files22 against a library knowledge base 28 for purposes of suggestionlibrary functions as replacement for one or more lines of code from theinput source code files. The configuring of the library suggestionengine 13 may include providing application specific hardware, firmware,or the like to facilitate the performance of the operations andgeneration of the outputs described herein with regard to theillustrative embodiments. In addition or in the alternative, theconfiguring of the library suggestion engine 13 may include storingsoftware applications in one or more storage devices and loaded intomemory of a computing device, such as server 10, for causing one or morehardware processors (e.g., 11) of the computing device to execute thesoftware applications that configure the processors to perform theoperations and generate the outputs described herein with regard to theillustrative embodiments. Moreover, any combination of applicationspecific hardware, firmware, software applications executed on hardware,or the like, may be used without departing from the spirit and scope ofthe illustrative embodiments.

As will be appreciated, once the server/computer system 10 is configuredto implement the library suggestion engine 13, the server/computersystem 10 becomes a specialized computing device specifically configuredto implement the mechanisms of the illustrative embodiments and is not ageneral purpose computing device. Moreover, as described hereafter, theimplementation of the mechanisms of the illustrative embodimentsimproves the functionality of the computing device and provides a usefuland concrete result that facilitates the generation of library functionrecommendations for a program developer by pruning input source code 22into candidate code snippets 24 which are then matched as validated codesnippets 25 with corresponding library functions 26 based on a measureof fuzzy and/or input/output matching similarity for presentation to theprogram developer as library function recommendations 27.

The library suggestion engine 13 may evaluate the input source codefiles to reduce or prune the number of potential candidate source codesnippets for library suggestion by applying natural language processing(NLP) techniques 31 to reduce the processing burden for making libraryfunction recommendations. To this end, the library suggestion engine 13may be provided with a pruning engine 14 for analyzing the input sourcecode files 22 (e.g., Source Code File A, Source Code File B, Source CodeFile C, . . . Source Code File n) using any suitable technique toidentify candidate code snippets 24 (e.g., Source Code File A and SourceCode File B) and remove others which are not likely candidates forlibrary function substitution (e.g., Source Code File C and Source CodeFile n).

As a preliminary step in identifying the candidate code snippets 24, thepruning engine 14 may apply NLP techniques 31 to generate source codefeature vectors 23 by checking for the presence of predetermined wordsin the input source code files 22 and assigning a corresponding weight.For example, the pruning engine 14 may be configured to apply suitableNLP techniques 31 to make the source code feature vectors 23, includingbut not limited to a tokenization step (which breaks each source codefile into words, phrases, symbols and other elements known as tokens), alowercasing step (which normalizes the source code files by lowercasingthem), a stopwords removal step (which removes grammatical words, knownas stopwords, and java-specific words from the source code files), afull form conversion step (which converts short form words, such as stror inp, in the source code file to full form, such as string or input),a semantic sense addition step (which adds contextual or semanticinformation to key words in the source code file, such as adding “loop$”if the keyword is in loop or adding “condition$” if the keyword isinside a conditional statement), a stemming step (which reduces words inthe source code file to their root form by removing inflectional wordendings), a splitting step (which converts combined words into separatewords), and/or a similar sense detection step (which uses Wordnet to addsimilar words, such as synonyms, to the words in the source code file).In selected embodiments, the pruning engine 14 may also be configured touse an NLP or machine learning process which applies a topical model,such as a Latent Dirichlet Allocation (LDA) module 15 or Latent SemanticAnalysis (LSA) module 16, to extract topics in the input source codefiles 22. In addition, the pruning engine 14 may be configured to use aterm frequency-inverse document frequency (TF-IDF) module 17 to identifyimportant keywords in the input source code files 22. Once the importantkeywords or topics from the input source code files are identified withthe LDA, LSA, and/or TF-IDF algorithms, the pruning engine 14 may beconfigured to combine the results into net result source code featurevectors 23, such as by using a dot product of the priority of eachkeyword with their priority value found from LSI, LDA, and TF-IDFalgorithms, respectively.

Once the source code feature vector files 23 are generated, the pruningengine 14 may be further configured to identify candidate code snippets24 by applying pruning process 32 to identify candidate code snippets 24from the input source code files 22 that are likely candidates forlibrary function substitution opportunities. For example, the pruningengine 14 may be configured with a heuristic engine or module whichcomputes a (one time) pruning threshold (e.g., Pruning Threshold 1) foreach library function (e.g., Library Function 1) from the libraryfunction code snippets (e.g., LF Code Snippet(s) 1) which perform thesame or essentially the same function as the library function. Inselected embodiments, the pruning threshold may be calculated as theminimum of the dot product of vector achieved from the library functioncode snippets from permutation of the library knowledge base 28. Thispruning threshold and the average vector may then be used to categorizewhether a source code file should be further analyzed as a candidatecode snippet 24.

To provide additional details for an improved understanding of selectedembodiments of the present disclosure for pruning input source codefiles, the following use case scenario is provided for analyzing twoinput source code files 22, namely Source Code File A=a.java and SourceCode File B=b.java. In this example, the first input source code file,a.java, is set forth below:

a.java package example; class a{  public static void main(String args[]){   int b;   String a = “hello”;   b(a);   System.out.println(a);  } }

In addition, the second input source code file, b.java, is set forthbelow: b.java:

package example; import java.io.*; import java.io.BufferedReader; classb {  public static String readFile(String file) throws IOException {  /* This function is used for reading a file to string   */  BufferedReader br;   br = new BufferedReader(new FileReader(file));  StringBuilder sb = new StringBuilder( );   while(br.ready( )){    sb.append(br.readLine( ));     sb.append(‘\n’);    }    br.close( );   return sb.toString( );   } }

Continuing with this example use case scenario, the NLP processing 31 ofthe input source files 22 performed by the pruning engine 14 would beused to generate a feature vector consisting of a string of identifiedkeywords or topics, each having an associated or computed weightingfactor. For example, a source code feature vector 23 (e.g., FeatureVector File B) for the input source code file 22 (e.g., Source Code FileB) would be generated from the sample source code b.java as thefollowing vector structure:

-   -   [‘loop$readi’, 0.3247174394233218], [‘tostr’,        0.3903609231317347], [‘loop$append’, 0.4470159023826545]        [‘loop$readlin’, 0.4609584097830426], [‘builder’,        0.5936101105253638], [‘readlin’, 0.6050065274587427], [‘file’,        0.6998090230209926], [‘stringbuild’, 0.7123321326304367],        [‘append’, 0.7481612762292236], [‘loop$line’,        0.8873805425301969], [‘read’, 0.9581944056457393],        [‘bufferedread’, 1.659810014435204], [‘line’,        1.6774363021832421], [‘buffer’, 1.705919490241575]

Using the source code feature vectors 23, each corresponding source codefile 22 is evaluated against the different library functions (e.g.,Library Functions 1-i) stored in the library knowledge base 28. To thisend, each library function (e.g., Library Function 2) stores basicinformation about library function, an associated library function codesnippet (e.g., LF Code Snippet 2), a pruning threshold value (e.g.,Pruning Threshold 2), a pruning vector (e.g., Pruning Vector 2)specifying a feature vector for the library function, along withadditional matching parameters described more fully hereinbelow, such asdistance and size threshold values and an Ngram threshold value.

As disclosed herein, the basic library function information for LibraryFunction 2 may include the signature for the library function, a linkwhere the library code is hosted (e.g., github link), the documentationlink, educational content, etc. In addition, an example LF code snippet2 which perform same work as Library Function 2 for apache commonsIOUtils to string function can be:

public static String lib_readFile12(InputStreamReader is) throwsIOException {  StringBuilder s = new StringBuilder( );  BufferedReaderbr = new BufferedReader(is);  while (br.ready( )) {  s.append(br.readLine( )+“\n”);  }  String s2 = s.toString( ); br.close( );  return s2; }

In addition, an example pruning threshold value (e.g., Pruning Threshold2) and pruning vector (e.g., Pruning Vector 2) for Library Function 2may be stored in the library knowledge base 28 with the following vectorstructure:

-   -   ‘apache.commons.io.IOUtils.toString’: [0.26090225563909775,        [[[‘ngramsi’, 0.0392156862745098], [‘array’,        0.05084745762711865], [‘add’, 0.05084745762711865],        [‘outstream’, 0.05172413793103448], [‘method$loop$reader’,        0.05298245614035088], [‘method$loop$readlin’,        0.05298245614035088], [‘method$loop$read’, 0.05298245614035088],        [‘file_nam’, 0.057167356450603515], [‘sock’,        0.0603448275862069], [‘data’, 0.06707317073170732],        [‘arraylist’, 0.06779661016949153], [‘loop$file’,        0.06936247840182302], [‘hasnextlin’, 0.07407407407407407],        [‘loop$nextlin’, 0.07407407407407407], [‘loop$hasnextlin’,        0.07407407407407407], [‘nextlin’, 0.07407407407407407],        [‘loop$reader’, 0.09126873586033678], [‘method$loop$append’,        0.10596491228070176], [‘fileinputstream’, 0.11433471290120703],        [‘list’, 0.11864406779661017], [‘fileread’,        0.15390307066222714], [‘method$loop$line’, 0.15894736842105261],        [‘inputstreamread’, 0.2571415633386791], [‘scanner’,        0.25925925925925924], [‘input’, 0.31993278485297943], [‘readi’,        0.3247174394233218], [‘loop$readi’, 0.3247174394233218],        [‘stream’, 0.3544155434736691], [‘tostr’, 0.3903609231317347],        [‘loop$append’, 0.4470159023826545], [‘stringbuff’,        0.4587506367647674], [‘loop$readlin’, 0.4609584097830426],        [‘loop$read’, 0.5219340195391402], [‘builder’,        0.5936101105253638], [‘readlin’, 0.6050065274587427], [‘file’,        0.6998090230209926], [‘stringbuild’, 0.7123321326304367],        [‘append’, 0.7481612762292236], [‘loop$line’,        0.8873805425301969], [‘read’, 0.9581944056457393],        [‘bufferedread’, 1.659810014435204], [‘line’,        1.6774363021832421], [‘buffer’, 1.705919490241575], [‘reader’,        2.164677513480203]]]]

In this example vector structure, the first term is the pruningthreshold (e.g., Pruning Threshold 2=0.26090225563909775), and theremaining vector structure includes a sequence of feature vectors wherethe first term is a key word or topic from the library function codesnippet, and the second term is the strength or weighting factorassigned to the first term. Stated more generally, the pruning vectorfor a given library function may be represented as: {pruning_threshold,[[keyword_to_search, strength_of_the_keyword_in_given_context]]}.

Similar to the NLP vector processing 31 described above, a uniquepruning vector (e.g., Pruning Vector 1-i) for each library function(e.g., Library Functions 1-i) may be generated by applying NLPtechniques to identify predetermined words from the correspondinglibrary function/LF code snippet and assign a corresponding weight.Example feature vector algorithms include tokenization steps,lowercasing steps, stopword removal steps, full form conversion steps,semantic sense addition steps, stemming steps, splitting steps, similarsense detection steps, LDA processing steps, LSA processing steps,and/or TF-IDF processing steps.

Continuing with this example use case scenario, the pruning engine 14may be configured to reduce or filter the input source code files 22down to a smaller set of candidate code snippets 24 with a pruningprocess 32 that evaluates the source code feature vectors 23 againstlibrary function information in the library knowledge base 28. In thepruning process 32, each source code feature vector 23 may be comparedfor similarity to the pruning vectors in each library function using asimilarity threshold value. For example, the input source code featurevector (e.g., Feature Vector File B) generated from an sample inputsource code file (e.g., Source Code File B=b.java) may be compared witheach of the library function pruning vectors (e.g., Pruning Vectors 1-i)to determine if the sample input source code file (e.g., Source CodeFile B=b.java) qualifies as a candidate code snippet 24. With thesefeature vector examples of this use case scenario, the pruning process32 is applied by the pruning engine 14 to identify Source Code FileB=b.java as a candidate code snippet by evaluating Feature Vector File Bagainst the pruning vector (e.g., Pruning Vector 2) for the LibraryFunction 2=“apache.commons.io.IOUtils.toString” stored in the libraryknowledge base 28. This evaluation may be performed as a dot productcomputation of common terms from Feature Vector File B and PruningVector 2 by multiplying the weights for the common terms and summing theresults to determine if the resulting value exceeds the pruningthreshold (e.g., Pruning Threshold 2=0.26090225563909775). In this case,the dot production computation value is 13.1299337163802074136 andexceeds the value for the Pruning Threshold 2, indicating that thecorresponding input source code file (e.g., Source Code File B)qualifies as a candidate code snippet 24. However, if the dot productcomputation from Feature Vector File C and the library function pruningvectors does not exceed the any of the pruning threshold values for theLibrary Functions 1-i, then the corresponding input source code file(e.g., Source Code File c) does not qualify as a candidate code snippet24.

Once the candidate code snippets 24 are identified, the librarysuggestion engine 13 may read and analyze the candidate code snippets 24by applying NLP matching techniques 33 to extract features from thecandidate code snippets 24 for comparison matching with featuresextracted from a given library function. To this end, the librarysuggestion engine 13 may be provided with a matching engine 18 foridentifying validated code snippets 25 from the input source code whichmatch with library functions in the library knowledge base 28. Inselected embodiments, the matching engine 18 may employ a white boxmatching (WBM) module 19 to perform fuzzy or internal match processing33 which reads and analyzes the candidate code snippets 24 to extractpredetermined features for matching with the features extracted from agiven library function, thereby generating validated code snippets 25(e.g., from Source Code File B) which can be replaced by a matchinglibrary function 26 (e.g., from Library Function 2). In addition or inthe alternative, the matching engine 18 may employ a black box matching(BBM) module 20 to perform input/output matching which injects sharedinputs to candidate code snippets 24 and library function code snippetsto detect matching outputs, thereby generating validated code snippets25 (e.g., from Source Code File B) which can be replaced by a matchinglibrary function 26 (e.g., from Library Function 2).

Once the matching library functions 26 are identified, the librarysuggestion engine 13 may present library function recommendations 27 tothe program developer with suggestions for swapping the validated codesnippets 25 with the matching library functions 26. In selectedembodiments, a library function recommendation 27 may include thevalidated source code snippets from the input source code files (e.g.,Source Code File B) along with a visual indication that suggests alibrary function (e.g., Library Function 2) for replacement orsubstitution. For example, a first user interface display screen mayshow an input source code file (e.g., Source Code File B) with thevalidated code snippet 25 highlighted or otherwise visually set off fromthe remaining lines of code in the input source code file, such as byincluding a user interaction link which opens a second user interfacedisplay screen to show information relating to the matching libraryfunction 26 (e.g., Library Function 2).

To provide a contextual understanding for selected embodiments of thepresent disclosure, reference is now made to FIG. 2 which illustrates adetection workflow 200 for generating library reuse recommendations 240from input source code and binaries 202 in accordance selectedembodiments of the present disclosure. In selected embodiments, thedepicted detection workflow 200 may be implemented in whole or in partwith a data processing system (such as shown in FIG. 1) and/or a singleintegrated circuit (e.g., a system-on-chip) or a plurality of integratedcircuits to implement one or more processors with local memory anddatabase storage that are interconnected and interoperate using anysuitable techniques without departing from the present invention.

However implemented, the detection workflow 200 receives input code(block 202) which may be checked into the system as source code andbinary files created by the program developer. An additional input tothe detection work flow 200 is the library function information 236provided by the library knowledge base 234 which stores library functioninformation, code snippets which perform the same work as a libraryfunction, pruning threshold and pruning vector information, distance andsize threshold information, and Ngram threshold information. To manageand curate the library function information 236 in the library knowledgebase 234, the library model developer 230 may submit configuration files232 which represent the data needed to recognize each library functionin the library. For example a configuration file for a single libraryfunction may include the name of the library (e.g., library_name), thename of the library function (e.g., library_function_name), librarydescriptors information (e.g., information specifying the property of aparticular library function), an http url link to the documentation(e.g., documentation_link), a method signature (e.g., signature), one ormore custom inputs that can be passed to the library functions, one ormore transform functions for converting complex type to simple type, alist of conditions that will determine a valid match when the expressionevaluates to True (e.g., equal_function_True), a list of conditions thatwill determine a valid match when the expression evaluates to False(e.g., equal_function_False), and or more code snippets that will helpestablish a pattern for the code (e.g., code_snippets). In this way, thelibrary knowledge base 234 has only the best of library functions, andcan also support customized library code for customer needs so that theycan import their particular library usage within their organization.

Upon check-in to the detection workflow 200, the input code is pruned orparsed by the pruning engine 210 to identify candidate code snippets forlibrary suggestion opportunities. While any suitable pruning approachmay be used, selected embodiments may employ a tokenization engine 212which uses NLP processing to break the input code into tokens 213 (e.g.,tokenized source code) which are passed to the heuristic engine 214. Theheuristic engine 214 is also connected to receive library functioninformation 236 from the library knowledge base 234 which stores datathat may be curated and standardized according to frequency in terms ofusage, number of issues, commits, contributions, and various otherfactors. In selected embodiments, the heuristic engine 214 pools thetokens into candidate code snippets 215 using various techniques, suchas polygraph, latency, and indexing, LDA, etc. The resulting candidatecode snippets 215 are then passed to a matching engine 220 which is inturn composed of two different engines —a fuzzy or internal matchingengine 222 and an input/output matching engine 228.

Fuzzy/Internal or White Box Matching

At the fuzzy/internal matching engine 222 (also referred to as a “whitebox matching” engine), each received candidate code snippet 215 isprocessed for matching with library feature vectors from the libraryfunction information 236 based on their structural and execution flowsimilarity. To this end, the fuzzy/internal matching engine 222 may beprovided with an Abstract Syntax Tree (AST) matching algorithm 224 foridentifying validated code snippets from the input source code whichmatch with library functions in the library knowledge base 234. Inselected embodiments, the AST matching algorithm 224 may employ a syntaxtree to represent the abstract syntactic structure of the candidate codesnippets 215 and library function code snippets 236B from the libraryknowledge base 234 that are written in a source code programminglanguage. Each node of the tree denotes a construct occurring in thesource code. In addition, the syntax is “abstract” in not representingevery detail appearing in the real syntax. For instance, groupingparentheses are implicit in the tree structure, and a syntacticconstruct like an if-condition-then expression may be denoted by meansof a single node with three branches. In selected embodiments, the ASTmatching algorithm 224 may be embodied with the Clone Digger duplicatecode detection tool which performs anti-unification analysis of the ASTof the library function code snippets 236B and the candidate codesnippets 215 being validated. In operation, the AST matching algorithm224 constructs an abstract syntax tree (AST) for each code snippet beinganalyzed in any desired source code language, such as Python, Java, andother programming languages, such as Java 8. For example, the ASTmatching algorithm 224 may be implemented by creating a wrapper on topof Clone Digger to extend the AST matching for Java 8 code snippets withimproved accuracy and efficiency.

For improved accuracy for of the AST matching algorithm 224, the ASTsize threshold and distance threshold values may be adjusted or tweakedfor each different library function, and then stored while onboardingany new library function in the library knowledge base 234 for automatedusage. As will be appreciated, the AST size threshold value specifiesthe minimum size of the nodes in each abstract syntax tree, while theAST distance threshold values specifies the maximum distance which isallowed for two ASTs to qualify as matching. In accordance with thepresent disclosure, the AST distance threshold value for each libraryfunction may be calculated from the library function code snippets inthe library knowledge base 234 which are permuted and applied to theClone Digger anti-unification algorithm. In addition, the AST sizethreshold value may be calculated as the minimum number of nodes in thelibrary knowledge base 234 multiplied by a constant factor which is lessthan 1. The Clone Digger tool used to implement the AST matchingalgorithm 224 may also be modified to allow changes to the variable nameand function name parameters and/or to remove the report generationfeature.

Continuing with an example use case scenario to illustrate how the fuzzyor internal matching engine 222 compares features from a candidate codesnippet 215 and library function code snippet 236B, the AST matchingalgorithm 224 is used to construct an AST for each candidate codesnippet 215 and library function code snippet 236B and then apply aclustering algorithm to find similar code snippets, such as by using theant-unification algorithm from the Clone Digger implementation of theAST matching algorithm 224. In addition, Ngram matching algorithm 226 isused to break the candidate code snippet (e.g., Source Code FileB=b.java) into class and then into system level instructions as setforth below:

-   -   indexOf:(Ljava/lang/String;)I        ShowWeekdayR.main:([Ljava/lang/String;)V,15 0        indexOf:(Ljava/lang/String;)I        ShowWeekdayR.main:([Ljava/lang/String;)V,38 0        indexOf:(Ljava/lang/String;)I        ShowWeekdayR.main:([Ljava/lang/String;)V,61 0 split:        (Ljava/lang/String;)[Ljava/lang/String;        ShowWeekdayR.main:([Ljava/lang/String;)V,72 0        java/lang/Integer.parseInt:(Ljava/lang/String;)I        ShowWeekdayR.main:([Ljava/lang/String;)V,80 0        java/lang/Integer.parseInt:(Ljava/lang/String;)I        ShowWeekdayR.main:([Ljava/lang/String;)V,86 0

After converting both the library function code snippets and thecandidate code snippets being analyzed, the fuzzy/internal matchingengine 222 finds the similar code snippets at function level.

To provide additional match processing, the fuzzy/internal matchingengine 222 may also be provided with an Ngram matching algorithm 226 foridentifying validated code snippets from the input source code whichmatch with library functions in the library knowledge base 234. Inselected embodiments, the Ngram matching algorithm 226 may employ acontiguous sequence of n items formed from the ASM files which in turnare extracted from Class files to represent the internal structure ofthe candidate code snippets 215 and library function code snippets 236Bfrom the library knowledge base 234 that are written in a source codeprogramming language. In operation, the Ngram matching algorithm 226extracts n-grams from a given candidate code snippet 215 for comparisonwith the Ngrams extracted from library function code snippets 236B fromthe library knowledge base 234. In selected embodiments, the Ngrammatching algorithm 226 may be embodied with the Agec execution-semanticclone detection tool which analyzes the library function code snippets236B and the candidate code snippets 215 being validated. In operation,the Ngram matching algorithm 227 applies an abstract interpretation tobytecode as a static analysis in order to generate n-grams from thecandidate code snippets 215, detects the same n-grams from distinctplaces of the library function code snippets 236B, and then reportsthese ngrams as code clones.

For improved accuracy for of the Ngram matching algorithm 226, the Ngramthreshold value may be adjusted or tweaked for each different libraryfunction, and then stored while onboarding any new library function inthe library knowledge base 234 for automated usage. As will beappreciated, the Ngram threshold value specifies the minimum number ofNgrams which need to be matched in order for the candidate code snippetto be validated. In accordance with the present disclosure, the Ngramthreshold value for each library function may be calculated by findingthe minimum of maximum number of Ngrams present in the library knowledgebase 234. In addition, the Agec clone detection embodiment of the Ngrammatching algorithm 226 may be modified to provide ASM-level operatorsand/or to add literals and parent function features for similar codedetection. In other embodiments, the Agec clone detection tool used toimplement the Ngram matching algorithm 226 may also be extended to workwith input data types (such as array, Integer, String, etc.), to allowfor multiple function invocations within the same file, and/or to autogenerate custom inputs by extracting test cases from the libraryfunction test cases.

In selected embodiments, the AST matching algorithm 224 and Ngrammatching algorithm 226 may be further modified for improved accuracy byadding a literal or constant Ngram to require a strict matchingalgorithm in cases where the literal constants play an important rolefor a code snippet to work similar to a library function. For example,when a removeExtension instruction has a literal constant of ‘.’ whichwhen replaced with something like ‘|’ in the candidate code snippet beanalyzed, then the matching algorithm should not yield a librarysubstitution opportunity as removeExtension, even though most of the ASTand Ngrams are similar with the library knowledge base 234.

Input/Output or Black Box Matching

In addition to performing fuzzy/internal matching, the input/outputmatching engine 228 (also referred to as a “black box matching” engine)is configured to inject shared inputs into the candidate code snippets215 and the library functions via JARs which are extracted via mavenlinks presented in the library function information 236 to see if thecandidate code snippet output is similar to the library function codesnippet output. Based on the output similarity, the input/outputmatching engine 228 assigns a similarity rating. If the outputs match,the candidate code snippet 215 being analyzed is validated for possiblereplacement with the matching library function.

Continuing with an example use case scenario to illustrate how theinput/output matching engine 228 injects a shared input into a candidatecode snippet 215 and library function code snippet 236B to compare theoutput results, consider the example of the following input candidatecode snippet 215 being compared at the input/output matching engine 228is set forth below:

  --code-- if (path.indexOf(“\\”) == −1) {   answer = path;  } answer =path1; --code--

At the input/output matching engine 228, this input candidate codesnippet is converted to:

public java.lang.String testMethod(String testMethodInput_0, StringtestMethodInput_1) throws Exception {String path = testMethodInput_0; if (path.indexOf(“\\”) == −1) {    return path;   }  StringreturnTestMethodVar = testMethodInput_1;   return returnTestMethodVar; }

The input/output matching engine 228 may then use an interface program,such as Py4J, to pass inputs into this function, and the results arematched with corresponding library function results which are calculatedby running jar with same parameters.

The main challenge for performing input/output matching is to extractthe right code snippets for matching analysis. The performance ofinput/output matching at the function level of granularity rarely workssince most of the library suggestion opportunities are hidden withincode segments that are difficult to recognize. To address thislimitation, the input/output matching engine 228 may be configured tocheck each and every code snippet line by treating them as start and endlines. While doing this, the code snippet AST is analyzed to maintain asymbol table. Based on the input parameters to the input/output matchingengine 228 and the return type of the library function being analyzedfor suggestion, validated code snippets 229 may be extracted. To thisend, the input/output matching engine 228 extracts all the basic importsused in the candidate code snippet 215 being analyzed and the candidatecode snippet is templatized by forming appropriate class with functiondefinition. Next, the candidate code snippet is checked to see if it iscompilable. If the candidate code snippet is compilable, a predeterminedset of inputs is injected into the candidate code snippet and theresulting output is checked to see if they are similar or identical tothe outputs from the library function.

By combining the outputs from the fuzzy/internal matching engine 222 andinput/output matching engine 228, the matching engine 220 identifiesvalidated code snippets 229 with matching library functions 229 whichare output as library reuse recommendations 240.

Presenting Library Function Recommendations

The results of the match processing by the matching engine 220 arepresented to the programmer as one or more library functionrecommendations which include may include code lines from input sourcecode files (e.g., validated code snippets) along with code lines fromthe recommended library function. To assist the developer with therecommended library substitution, the developer may also be providedwith additional library function information identifying the codeimprovement recommendation and/or code reduction resulting from thelibrary function recommendation and/or educational tutorial informationrelating to the implementation of the library function recommendation.

To provide additional details for an improved understanding of selectedembodiments of the present disclosure, reference is now made to FIG. 3which depicts a simplified flow chart 300 showing the logic forrecommending validated library function substitutions to a developer inaccordance selected embodiments of the present disclosure. Theprocessing shown in FIG. 3 may be performed by a cognitive system, suchas the computing system 100 shown in FIG. 1 or other natural languageprocessing system.

At step 301, source code files are written or retrieved by a developer,and then checked in or committed at step 310. At this point in thesoftware development process, the source code includes untested codethat may be fragile, bloated, untested, and low quality code whichcontains undiscovered bugs and is otherwise inefficient and not readilyreadable.

At step 320, input source code files are pruned or filtered to identifysource code files that are likely candidates for library functionsuggestions while removing source code files that do not have certainkeywords that are most likely to qualify for library functionsuggestions. The processing performed at step 320 may use machinelearning, natural language processing, and/or artificial intelligencetechniques to find keywords in the input source code files and thenassign a priority or weight value. In selected embodiments, the pruningstep 320 may be implemented with a feature vector generation step 321which uses vector formation techniques to generate feature vectors foreach input source code file. Using the generated feature vectors alongwith library function feature vectors retrieved from memory, candidatecode snippets from the input source code files may be identified at step322 by comparing the input source code file feature vectors and thelibrary function feature vectors to generate a numerical similaritymeasure that may be compared with a pruning threshold values for thecorresponding library function. The computation steps performed at step322 to identify similarities between the feature vectors may includetokenizing input code snippets and code snippets from the libraryfunctions to generate comparative file vectors which are evaluated(e.g., by dot product) against a pruning threshold to identify candidatecode snippets, checking for the presence of predetermined words in theinput code and assigning a corresponding weight, or by any othersuitable code filtering operations for identifying candidate codesnippets from the input code that should be further processed forlibrary suggestion opportunities.

At step 330, the pruned input source code files (e.g., candidate codesnippets) are validated and matched with library function informationcontained in the knowledge base to identify validated source code files(e.g., validated code snippets). The processing performed at step 320may use machine learning, natural language processing, and/or artificialintelligence techniques in combination with static and/or dynamic codeanalysis to identify and validate input source code files that likelyqualify for library function suggestions. In selected embodiments, thevalidation and matching step 330 may be implemented with a first matchprocessing step 331 which matches code snippet features extracted froman input source code file with extracted library function features, suchas by using abstract syntax tree and/or Ngram execution flow matchingalgorithms. In effect, the first match processing step 331 performsfuzzy matching of the structural syntax and/or bytecode execution flowusing automated matching threshold values (e.g., AST size and distancethresholds and/or Ngram thresholds).

In selected embodiments, the validation and matching step 330 may alsoinclude a second match processing step 332 which performs input/outputmatching by injecting shared inputs to input code snippets and libraryfunction code snippets to detect matching outputs, thereby generatingvalidated code snippets which can be replaced by a library function. Ineffect, the second match processing step 332 performs exact matching toconfirm that the code snippets are the same if the same input yields thesame outputs. In selected embodiments, the second match processing step332 may be configured to extract library signature information from alibrary function, and to then extract candidate code snippets. Theextracted candidate code snippets may then be templated according to theextracted library signature and then compiled so that a shared input isinjected into the compiled code to generate outputs which are comparedto outputs generated from the library function on the basis of theshared input.

At step 340, the library function substitutions are recommended for eachvalidated source code file (e.g., validated code snippets) so that theprogram developer is presented with one or more library functionrecommendations which include may include code lines from input sourcecode files along with code lines from the library function suggestion,alone or in combination with additional library function informationidentifying the code improvement recommendation and/or code reductionresulting from the library function recommendation and/or educationaltutorial information relating to the implementation of the libraryfunction recommendation. The processing performed at step 340 may beperformed by a cognitive system, such as the computing system 100 shownin FIG. 1 or other data processing system functionality for displayinguser interface information. In selected embodiments, the recommendationstep 340 may be implemented with a first processing step 341 whichidentifies a code improvement and/or code reduction from the librarysubstitution recommendation, such as by quantifying a performancebenefit or potential code reduction that would result from using thelibrary function recommendations. In addition, the recommendation step340 may include a second processing step 342 which presents the librarysubstitution recommendation to the developer, alone or in combinationwith information about a code improvement or code reduction. As will beappreciated, the library substitution recommendation presented at step342 may be included in the same user interface screen or a differentuser interface screen in which the code improvements and/or codereductions are identified for the developer. In addition, therecommendation step 340 may include a third processing step 343 whichpresents the developer with an education tutorial about the librarysubstitution recommendation, such as by displaying the recommendedreplacement code for recommended library function along an explanationof the benefits of the recommended library function, a link to thesuggested library function, and a video explaining how to implement thesuggested library function.

To provide additional details for an improved understanding of selectedembodiments of the present disclosure, reference is now made to FIGS.4A-C which depict an example sequence of user interface screen shots fora library suggestion engine in accordance selected embodiments of thepresent disclosure. In the first example screen shot of user interface400 shown in FIG. 4A, there is displayed is a shown a summary oroverview for the evaluation of a plurality of input source code filesfor library suggestion recommendations. For example, the user interface400 shows a build status report 402, code quality report 403, unit testreport 405, and suggested library usage report 405 for a first inputsource code file (Build #113, Rev 4141) that has been committed orloaded into the library suggestion engine. As indicated in the libraryusage report 405, the user interface 400 indicates that one issue hasbeen detected and that the recommended library function will reduce thesize of the source code by four lines if selected by the developer forsubstitution or replacement.

By using the cursor 401 or other user interface controls to interactwith the user interface 400, the developer may cause the librarysuggestion engine to display a second user interface screen shot 410which illustrates a code reduction opportunity for the selected inputsource code file, as illustrated in FIG. 4B. In this example, the userinterface 410 shows a file identification field 412 for the first inputsource code file (e.g., Build #113, Rev 4141), an auto-classificationfield 413, code line replacement field 414, a code reduction field 415,and a library field 416. The file identification field 412 identifiesthe input source code file. The auto-classification field 413automatically shows that the first input source code file is a “fileoperation” file. The code line replacement field 414 shows the number ofcurrent code lines (in the validated code snippet) and the proposednumber of code lines (from using the recommended library function). Thecode reduction field 415 shows a quantification of the code reductionbenefit. And the library field 416 provides a link to additionalinformation for educating the developer about how to implement therecommended library function. Below the fields 412-416, the second userinterface screen shot 410 may also display the first input source codefile 417 with the validated code snippet 418 highlighted or otherwisevisually set off from the remaining lines of code in the input sourcecode file 417. In order to access additional information relating to therecommended library function, the user interface 410 may include one ormore user interaction links 419 in addition to the library field 416 sothat, when actuated by the cursor 401, additional information about therecommended library function may be displayed.

Referring now to FIG. 4C, there is shown a third user interface screenshot 420 which illustrates additional library information 421-424relating to the recommended library function for replacing the validatedcode snippet 418. In this example, the user interface 420 shows a firstfield 421 for identifying library code (e.g., IOUtils.toString of theApache Commons Library) that can be used to replace the validated codesnippet 418. The user interface 420 may also include a second field 422for describing the benefits of using the library functionrecommendation. The user interface 420 may also include a video tutorial423 and a link 424 to the library repository (e.g., MVN Repository). Thevideo tutorial 423 can provide educational information to the programmeron how to replace the validated code snippet with the recommendedlibrary function and other information needed to migrate to therecommended library function.

Embodiments of the system and method for recommending librarysubstitutions can be implemented on a computer system, such as ageneral-purpose computer 500 illustrated in FIG. 5. As disclosed thecomputer 500 includes input user device(s) 516, such as a keyboardand/or mouse, which are coupled to a bi-directional system bus 508. Theinput user device(s) 516 are used for introducing user input to thecomputer system 500 and communicating that user input to processor 502.The computer system 500 may also include a video memory 504, main memory506, and mass storage 518, all coupled to bi-directional system bus 508along with input user device(s) 516 and processor 502. The mass storage518 may include both fixed and removable media, such as other availablemass storage technology. Bus 508 may contain, for example, 32 addresslines for addressing video memory 504 or main memory 506. The system bus508 may also include, for example, an n-bit data bus for transferringdata between and among the components, such as CPU 502, main memory 506,video memory 514, and mass storage 518, where “n” is, for example, 32 or64. Alternatively, multiplex data/address lines may be used instead ofseparate data and address lines.

The computer 500 may also include I/O device(s) 510 which provideconnections to peripheral devices, such as a printer, and may alsoprovide a direct connection to remote server computer systems via atelephone link or to the Internet via an ISP. I/O device(s) 510 may alsoinclude a network interface device to provide a direct connection toremote server computer systems via a direct network link to the Internetvia a POP (point of presence). Such connection may be made using, forexample, wireless techniques, including digital cellular telephoneconnection, Cellular Digital Packet Data (CDPD) connection, digitalsatellite data connection or the like. Examples of I/O devices includemodems, sound and video devices, and specialized communication devicessuch as the aforementioned network interface.

Computer programs and data are generally stored as instructions and datain mass storage 518 until loaded into main memory 506 for execution.Computer programs may also be in the form of electronic signalsmodulated in accordance with the computer program and data communicationtechnology when transferred via a network. The method and functionsrelating to system and method for generating library suggestions may beimplemented in a computer program for a library recommendation engine505.

The processor 502, in one embodiment, is a microprocessor manufacturedby Motorola Inc. of Illinois, Intel Corporation of California, orAdvanced Micro Devices of California. However, any other suitable singleor multiple microprocessors or microcomputers may be utilized. Mainmemory 506 is comprised of dynamic random access memory (DRAM). Videomemory 504 is a dual-ported video random access memory. One port of thevideo memory 504 is coupled to video amplifier or driver 512. The videoamplifier 512 is used to drive the display 514. Video amplifier 512 iswell known in the art and may be implemented by any suitable means. Thiscircuitry converts pixel data stored in video memory 504 to a rastersignal suitable for use by display 514. Display 514 is a type of monitorsuitable for displaying graphic images.

By now, it will be appreciated that there is disclosed herein a system,method, apparatus, and computer program product for enhancing operablefunctionality of a software program by performing a method at a devicehaving an operating system and system library. As disclosed, the system,method, apparatus, and computer program receive a plurality of inputsource code files from the software program submitted by a developer,such as by committing, to a library suggestion engine, source code andbinary files for the software program. Subsequently, one or morecandidate code snippets are identified from the plurality of inputsource code files by removing one or more code snippets that do not meeta similarity threshold measure for library functions stored in thesystem library. In selected embodiments, the candidate code snippets maybe identified by pruning the input source code files with an NLPanalysis of the input source code files to keep each candidate codesnippet which meets at least a first similarity threshold measure for afirst library function stored in the system library. The NLP analysismay include generating source code feature vectors from the plurality ofinput source code files and comparing the source code feature vectors tolibrary function feature vectors for library functions stored in thesystem library to identify at least a first candidate code snippet whichmeets at least a first similarity threshold measure for a first libraryfunction stored in the system library. In addition, the source codefeature vectors may be generated from the input source code files byemploying a vector formation technique selected from the groupconsisting of StopWords Removal, Full Form Conversion, Semantic SenseAddition, Stemming, Splitting, Similar Sense Detection, Latent SemanticIndexing, Latent Dirichlet Allocation and term frequency-inversedocument frequency. From the candidate code snippets, at least a firstvalidated code snippet is identified that matches a first libraryfunction stored in the system memory on the basis of at least first andsecond matching metrics. In selected embodiments, the first validatedcode snippet may be identified by performing machine learning andnatural language processing in combination with code analysis techniquesto implement a fuzzy matching algorithm for selecting a candidate codesnippet having first internal extracted features that match secondinternal extracted features from the first library function. In otherembodiments, the first validated code snippet may be identified byperforming machine learning and natural language processing incombination with code analysis techniques to implement an input/outputmatching algorithm for selecting a candidate code snippet whichgenerates the same output as the first library function when both areinjected with a shared input. Finally, the developer is presented with alibrary function recommendation which includes the first validated codesnippet, the first library function, and instructions for replacing thefirst validated code snippet with the first library function. Inselected embodiments, the library function recommendation may bepresented by displaying on one or more user interface screens the firstvalidated code snippet, the first library function, and instructions foreducating the developer on how to replace the first validated codesnippet with the first library function.

The present invention may be a system, a method, and/or a computerprogram product such that selected embodiments include software thatperforms certain tasks. The software discussed herein may includescript, batch, or other executable files. The software may be stored ona machine-readable or computer-readable storage medium, and is otherwiseavailable to direct the operation of the computer system as describedherein and claimed below. In one embodiment, the software uses a localor database memory to implement the data transformation and datastructures so as to automatically detect library substitutionopportunities, improve the quality and robustness of software, educatedevelopers about library opportunities and implementation and generatemore readable, reliable, smaller, and robust code with less effort. Thelocal or database memory used for storing firmware or hardware modulesin accordance with an embodiment of the invention may also include asemiconductor-based memory, which may be permanently, removably orremotely coupled to a microprocessor system. Other new and various typesof computer-readable storage media may be used to store the modulesdiscussed herein. Additionally, those skilled in the art will recognizethat the separation of functionality into modules is for illustrativepurposes. Alternative embodiments may merge the functionality ofmultiple software modules into a single module or may impose analternate decomposition of functionality of modules. For example, asoftware module for calling sub-modules may be decomposed so that eachsub-module performs its function and passes control directly to anothersub-module.

In addition, selected aspects of the present invention may take the formof an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.), or anembodiment combining software and/or hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present invention may take the form ofcomputer program product embodied in a computer readable storage mediumor media having computer readable program instructions thereon forcausing a processor to carry out aspects of the present invention. Thusembodied, the disclosed system, a method, and/or a computer programproduct is operative to improve the design, functionality andperformance of software programs by automatically detecting andrecommending library function substitutions for replacing validated codesnippets in the software program.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a dynamic or static random access memory(RAM), a read-only memory (ROM), an erasable programmable read-onlymemory (EPROM or Flash memory), a magnetic storage device, a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a Public SwitchedCircuit Network (PSTN), a packet-based network, a personal area network(PAN), a local area network (LAN), a wide area network (WAN), a wirelessnetwork, or any suitable combination thereof. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Java, Python, Visual Basic.net,Ruby, Smalltalk, C++ or the like, and conventional proceduralprogramming languages, such as the “C” programming language, HypertextPrecursor (PHP), or similar programming languages. The computer readableprogram instructions may execute entirely on the user's computer, partlyon the user's computer, as a stand-alone software package, partly on theuser's computer and partly on a remote computer or entirely on theremote computer or server or cluster of servers. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a sub-system, module, segment,or portion of instructions, which comprises one or more executableinstructions for implementing the specified logical function(s). In somealternative implementations, the functions noted in the block may occurout of the order noted in the figures. For example, two blocks shown insuccession may, in fact, be executed substantially concurrently, or theblocks may sometimes be executed in the reverse order, depending uponthe functionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

The computer system described above is for purposes of example only, andmay be implemented in any type of computer system or programming orprocessing environment, or in a computer program, alone or inconjunction with hardware. Various embodiments of the present may alsobe implemented in software stored on a computer-readable medium andexecuted as a computer program on a general purpose or special purposecomputer. For clarity, only those aspects of the system germane to theinvention are described, and product details well known in the art areomitted. For the same reason, the computer hardware is not described infurther detail. It should thus be understood that the invention is notlimited to any specific computer language, program, or computer. Thesystem and method for generating library suggestions may be implementedin any type of computer system or programming or processing environment.It is contemplated that the system and method for generating libraryfunction recommendations might be run on a stand-alone computer system,such as the one described above. The system and method for generatinglibrary suggestions might also be run from a server computer systemssystem that can be accessed by a plurality of client computer systemsinterconnected over an intranet network. Finally, the system and methodfor generating library suggestions projects may be run from a servercomputer system that is accessible to clients over the Internet.

Benefits, other advantages, and solutions to problems have beendescribed above with regard to specific embodiments. However, thebenefits, advantages, solutions to problems, and any element(s) that maycause any benefit, advantage, or solution to occur or become morepronounced are not to be construed as a critical, required, or essentialfeature or element of any or all the claims. As used herein, the terms“comprises,” “comprising,” or any other variation thereof, are intendedto cover a non-exclusive inclusion, such that a process, method,article, or apparatus that comprises a list of elements does not includeonly those elements but may include other elements not expressly listedor inherent to such process, method, article, or apparatus.

1. A method performed by a device having an operating system and asystem library for enhancing operable functionality of a softwareprogram, comprising receiving, by the device, a plurality of inputsource code files from the software program submitted by a developer;identifying, by the device, one or more candidate code snippets from theplurality of input source code files by removing one or more codesnippets that do not meet a similarity threshold measure for libraryfunctions stored in the system library; identifying, by the device, atleast a first validated code snippet from the one or more candidate codesnippets that matches a first library function stored in the systemmemory on the basis of at least first and second matching metrics; andpresenting, to the developer, a library function recommendationcomprising the first validated code snippet, the first library function,and instructions for replacing the first validated code snippet with thefirst library function. 2-26. (canceled)